from typing import List
def low_bound(nums:List[int],target)->int:
    left,right=0,len(nums)-1
    while left<=right:
        mid=(left+right)//2
        if nums[mid]>=target:
            right=mid-1
        else:
            left=mid+1
    return left

class Solution:
    def maximumCount(self, nums: List[int]) -> int:
        idx1=low_bound(nums,0)-1
        idx2=low_bound(nums,0+1)
        return max(idx1+1,len(nums)-idx2)

